36 research outputs found
The Adversarial Stackelberg Value in Quantitative Games
In this paper, we study the notion of adversarial Stackelberg value for two-player non-zero sum games played on bi-weighted graphs with the mean-payoff and the discounted sum functions. The adversarial Stackelberg value of Player 0 is the largest value that Player 0 can obtain when announcing her strategy to Player 1 which in turn responds with any of his best response. For the mean-payoff function, we show that the adversarial Stackelberg value is not always achievable but ?-optimal strategies exist. We show how to compute this value and prove that the associated threshold problem is in NP. For the discounted sum payoff function, we draw a link with the target discounted sum problem which explains why the problem is difficult to solve for this payoff function. We also provide solutions to related gap problems
The Complexity of Rational Synthesis
We study the computational complexity of the cooperative and non-cooperative rational synthesis problems, as introduced by Kupferman, Vardi and co-authors. We provide tight results for most of the classical omega-regular objectives, and show how to solve those problems optimally
Finite-Valued Weighted Automata
Any weighted automaton (WA) defines a relation from finite words to values: given an input word, its set of values is obtained as the set of values computed by each accepting run on that word. A WA is k-valued if the relation it defines has degree at most k, i.e., every set of values associated with an input word has cardinality at most k. We investigate the class of quantitative languages defined by k-valued automata, for all parameters k. We consider several measures to associate values with runs: sum, discounted-sum, and more generally values in groups.
We define a general procedure which decides, given a bound k and a WA over a group, whether this automaton is k-valued. We also show that any k-valued WA over a group, under some general conditions, can be decomposed as a union of k unambiguous WA. While inclusion and equivalence are undecidable problems for arbitrary sum-automata, we show, based on this decomposition, that they are decidable for k-valued sum-automata, and k-valued discounted sum-automata over inverted integer discount factors. We finally show that the quantitative Church problem is undecidable for k-valued sum-automata, even given as finite unions of deterministic sum-automata
The Adversarial Stackelberg Value in Quantitative Games
In this paper, we study the notion of adversarial Stackelberg value for
two-player non-zero sum games played on bi-weighted graphs with the mean-payoff
and the discounted sum functions. The adversarial Stackelberg value of Player 0
is the largest value that Player 0 can obtain when announcing her strategy to
Player 1 which in turn responds with any of his best response. For the
mean-payoff function, we show that the adversarial Stackelberg value is not
always achievable but epsilon-optimal strategies exist. We show how to compute
this value and prove that the associated threshold problem is in NP. For the
discounted sum payoff function, we draw a link with the target discounted sum
problem which explains why the problem is difficult to solve for this payoff
function. We also provide solutions to related gap problems.Comment: long version of an ICALP'20 pape
Toward Integration of Systems Biology Formalism: The Gene Regulatory Networks Case
We consider the problem of integrating different systems biology formalisms, namely, the process calculi based formalism, the modeling approach based on systems of differential equations, and the one relying on automata-like descriptions (and model checking). Specifically, we define automatic procedures for translating stochastic π-calculus descriptions of gene regulatory networks to S-systems differential equations. Tools for extracting and reasoning on (approximate) solutions of S-systems have been recently developed in the literature, and can be exploited to establish a link with automata-based systems biology and model checking techniques. Keywords: systems biology, gene regulatory networks, S-systems, process calculi